搜索资源列表
lipsolWIN32
- Linear programming Interior Point Solvers
coplsdp
- 基于MATLAB内点算法求解SDP半正定规划软件包-MATLAB-based interior-point algorithm for solving semidefinite program package SDP
bpmpd.tar
- for: sparse linear programming by an interior-point method by: Csaba Meszaros ref: "The Efficient Implementation of Interior Point Methods for Linear Programming and their Applications" by Csaba Meszaros, Ph.D. thesis, Eotvos Lorand University
bidding
- interior point for PSO
Secon
- 二阶锥规划的非精确不可行内点法Second-order cone programming of non-precise infeasible interior point method-Second-order cone programming of non-precise infeasible interior point method
l1minqc
- 程序描述了一种内点法的方法，能够实现具有等式不等式约束的线性最优算法求解-Procedure describes a method of interior-point method, to achieve equality with inequality constrained linear optimal algorithm
sdsa
- 带有P_0函数的非线性互补问题的一个新的非内点连续算法.-With P_0 function nonlinear complementarity problem, a new algorithm for continuous non-interior point.
wanghao
- 内点法求最优解，可以找到每个稳定域的平衡点。-Interior point method for the optimal solution
Convex11
- Matlab采用障碍法及原对偶内点法解决不等式约束凸优化问题-barry method, Original dual interior point method
Conjugate-gradient-method-matlab
- 共轭梯度法 SUMT内点法 最速下降法 牛顿法 matlab实现-Conjugate gradient method SUMT interior point method the steepest descent method Newton method matlab
Prosac
- 用opencv2.3.1+vs2008实现PROSAC算法。PROSAC是比ransac算法更快的剔除无匹配算法。前提是，这种策略的前提是假定匹配度高的特征是内点的概率比匹配度低的特征要高。 -With opencv2.3.1+ vs2008 realize PROSAC algorithm. PROSAC is faster than ransac algorithm of eliminate no matching algorithms. Premise is, this strategy
Nneidianceshi1
- 原对偶内点法求解非线性最优化问题的测试程序，能准确快速的收敛到最优值-Primal dual interior point method for solving nonlinear optimization problem of the test procedure can accurately and quickly converge to the optimal value
LP_test14node
- 电力系统连锁故障分析中的内点法最优潮流模型-Chain failure analysis of power system optimal power flow model of the interior point method
opflatestedition
- 内点法最优潮流程序 实现了有功损耗最小的经济分配。 本程序用ieee14节点网络测试-Interior point method OPF program to achieve the minimum power loss of economic distribution. The program ieee14 node network test
Constrained-optimization-problems
- 约束优化问题，包含 用Rosen梯度投影法求解约束多维函数的极值 用外点罚函数法求解线性等式约束多维函数的极值 用外点罚函数法求解一般等式约束多维函数的极值 用内点罚函数法求解约束多维函数的极值 用混合罚函数法求解约束多维函数的极值 用混合罚函数加速法求解约束多维函数的极值 用乘子法求解约束多维函数的极值 用坐标轮换法求解约束多维函数的极值 用复合形法求解约束多维函数的极值 -Constrained optimization problems contai
opf
- 完全极坐标的内点法最优潮流程序，通用版，所有节点可用。-OPF program completely polar coordinates interior point method, the generic version, all nodes are available.
matlab-neidian-optimal
- 用内点法实现电力系统潮流的优化问题上，代码完整，已经通过测试-Interior point method for power system optimization
inner
- 属于智能科学领域中的一个辅助学科-最优化。其方法为内点法，用于求解一已知函数的最小值。通过障碍函数的构建，使得最小值在约束条件内寻找，从而解决了有约束条件的极小值问题。-Belong to a secondary disciplines in the field of intelligent science- optimization. Its methodology for the interior point method for solving a known function of th
neidianfa-MATLAB
- 内点法matlab程序，其中包含对经济性要求条件-Interior point method matlab program, which contains the conditions of the economic requirements
neidianfa-opf
- 是关于使用内点法来研究的最优潮流计算。对于研究opf的具有一定帮助-Interior point method to study the optimal power flow calculation. Have some help for research opf